Semi-automatic process partitioning for parallel computation
نویسندگان
چکیده
منابع مشابه
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix derived from the web’s hyperlink structure and a user-centred model of web-surfing behaviour. As the web has expanded and as demand for user-tailored web page ordering metrics has grown, scalable parallel computation ...
متن کاملA Heuristic for Partitioning Parallel Computation
Parallel computation can usually be viewed as a weighted undirected graph, where graph nodes typically represent computation, and edges represent communication. One seeks to distribute the total workload (computation and communication) by partitioning the graph into subgraphs and assigning each subgraph to a processor such that every processor has approximately the same amount of workload. In t...
متن کاملMatrix Ordering Strategies for Process Engineering: Graph Partitioning Algorithms for Parallel Computation
The solution of large-scale chemical process simulation and optimization problems using parallel computation requires algorithms that can take advantage of multiprocessing when solving the large, sparse matrices that arise. Parallel algorithms require that the matrices be partitioned in order to distribute computational work across processors. One way to accomplish this is to reorder the matrix...
متن کاملAutomatic Computation and Data Partitioning on Scalable
Scalable shared memory multiprocessors are becoming increasingly popular platforms for high-performance scienti c computing because they both scale to large numbers of processors and support the familiar shared memory abstraction. In order to improve application performance on these machines, it is essential to divide computation among processors and to place data carefully in the distributed s...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 1987
ISSN: 0885-7458,1573-7640
DOI: 10.1007/bf01407902